Bi-cycle extendable through a given set in balanced bipartite graphs
نویسندگان
چکیده
منابع مشابه
Bi-cycle extendable through a given set in balanced bipartite graphs
Let G = (X, Y; E) be a balanced bipartite graph of order 2n. The path-cover number pc(H) of a graph H is the minimum number of vertex-disjoint paths that use up all the vertices of H. S ⊆ V(G) is called a balanced set of G if |S ∩ X| = |S ∩ Y|. In this paper, we will give some sufficient conditions for a balanced bipartite graph G satisfying that for every balanced set S, there is a bi-cycle of...
متن کاملBipartite matching extendable graphs
Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a pe...
متن کاملEdge cycle extendable graphs
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C is also formed from edges and one chord of a cycle C ′ of length one greater than C with V (C ) ⊆ V (C). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivale...
متن کاملCharacterizing minimally n-extendable bipartite graphs
In this paper, it is proved that let G be a bipartite graph with bipartition (X, Y ) and with a perfect matching M , let G be an n-extendable graph, then G is minimally n-extendable if and only if, for any two vertices x ∈ X and y ∈ Y such that xy ∈ E(G), there are exactly n internally disjoint (x, y) M-alternating paths P1, P2, . . . , Pn such that Pi (1 i n) starts and ends with edges in E(G)...
متن کاملConstruction for bicritical graphs and k-extendable bipartite graphs
A graphG is said to be bicritical ifG−u− v has a perfect matching for every choice of a pair of points u and v. Bicritical graphs play a central role in decomposition theory of elementary graphs with respect to perfect matchings. As Plummer pointed out many times, the structure of bicritical graphs is far from completely understood. This paper presents a concise structure characterization on bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.006